package Sort.Sort;

import java.util.Arrays;

public class TestSort {
    public static void main(String[] args) {
//        Integer[] array1 = {4, 3, 2, 10, 12, 1, 5, 6};
//        Integer[] array2 = {9, 1, 2, 5, 7, 4, 8, 6, 3, 5};
//        Integer[] array3 = {8, 4, 5, 1, 7, 3, 6, 2};
//        Integer[] array4 = {6, 1, 2, 7, 9, 10, 4, 5, 8};
        int[] array5 = {6, 1, 0, 7, 5, 10, 4, 5, 5};
//        int[] array5 = {53, 3, 542, 14, 256, 748};
//        Sort.insertionSort(array1);
//        Sort.shellSort(array2);
//        Sort.mergeSort(array3);
//        Sort.quickSort(array4);
//        Sort.radixSort(array5);
//        Sort.countingSort(array5);
        Sort.heapSort(array5);
//        System.out.println(Arrays.toString(array1));
//        System.out.println(Arrays.toString(array2));
//        System.out.println(Arrays.toString(array3));
//        System.out.println(Arrays.toString(array4));
//        for (int i = 0; i < array5.length; i++) {
//            System.out.print(array5[i] + " ");
//        }
        System.out.println(Arrays.toString(array5));
    }
}
